Privacy-Preserving k-Nearest Neighbor Computation in Multiple Cloud Environments
نویسندگان
چکیده
منابع مشابه
Privacy Preserving K-nearest Neighbor Classification
This paper considers how to conduct k-nearest neighbor classification in the following scenario: multiple parties, each having a private data set, want to collaboratively build a k-nearest neighbor classifier without disclosing their private data to each other or any other parties. Specifically, the data are vertically partitioned in that all parties have data about all the instances involved, ...
متن کاملPrivacy-Preserving Nearest Neighbor Methods
Comparing two signals is one of the most essential and prevalent tasks in signal processing. A large number of applications fundamentally rely on determining the answers to the following two questions: (1) How should two signals be compared? (2) Given a set of signals and a query signal, which signals are the nearest neighbors of the query signal, i.e., which signals in the database are most si...
متن کاملPrivacy Preserving Group Nearest Neighbor Search
Group k-nearest neighbor (kGNN) search allows a group of n mobile users to jointly retrievek points from a location-based service provider (LSP) that minimizes the aggregate distance to them. We identify four protection objectives in the privacy preserving kGNN search: (i) every user’s location should be protected from LSP; (ii) the group’s query and the query answer should be protected from LS...
متن کاملK-Nearest Neighbor Categorization on Secure Data Access in Cloud
For the last few years, a extensive research has been going on query processing of relation data and more practical and theoretical solution have been suggested to query processing under different scenarios. Now days cloud computing technology is increasing rapidly, so users now have the chance to store their data in remote location. However, different privacy issues are raised on cloud computi...
متن کاملFast Nearest Neighbor Preserving Embeddings
We show an analog to the Fast Johnson-Lindenstrauss Transform for Nearest Neighbor Preserving Embeddings in `2. These are sparse, randomized embeddings that preserve the (approximate) nearest neighbors. The dimensionality of the embedding space is bounded not by the size of the embedded set n, but by its doubling dimension λ. For most large real-world datasets this will mean a considerably lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2016
ISSN: 2169-3536
DOI: 10.1109/access.2016.2633544